von Neumann-Morgenstern farsightedly stable sets in two-sided matching
نویسندگان
چکیده
منابع مشابه
Von Neumann-Morgenstern Farsightedly Stable Sets in Two-Sided Matching
We adopt the notion of von Neumann-Morgenstern farsightedly stable sets to predict which matchings are possibly stable when agents are farsighted in one-to-one matching problems. We provide the characterization of von Neumann-Morgenstern farsightedly stable sets: a set of matchings is a von Neumann-Morgenstern farsightedly stable set if and only if it is a singleton set and its element is a cor...
متن کاملVon Neumann-Morgenstern stable sets in matching problems
The following properties of the core of a one-to-one matching problem are well-known: (i) the core is non-empty; (ii) the core is a lattice; and (iii) the set of unmatched agents is identical for any two matchings belonging to the core. The literature on two-sided matching focuses almost exclusively on the core and studies extensively its properties. Our main result is the following characteriz...
متن کاملVon Neumann-Morgenstern stable sets, discounting, and Nash bargaining
We establish a link between von Neumann–Morgenstern stable set and the Nash solution in a general n-player utility set. The stable set-solution is defined with respect to a dominance relation: payoff vector u dominates v if one player prefers u even with one period delay. We show that a stable set exists and, if the utility set has a smooth surface, any stable set converges to the Nash bargaini...
متن کاملAggregating sets of von Neumann-Morgenstern utilities
We analyze the aggregation problem without the assumption that individuals and society have fully determined and observable preferences. More precisely, we endow individuals and society with sets of possible von Neumann-Morgenstern utility functions over lotteries. We generalize the classical neutrality assumption to this setting and characterize the class of neutral social welfare function. Th...
متن کاملVon Neumann–Morgenstern stable-set solutions in the assignment market
Existence of von Neumann–Morgenstern solutions (stable sets) is proved for any assignment game. For each optimal matching, a stable set is defined as the union of the core of the game and the core of the subgames that are compatible with this matching. All these stable sets exclude third-party payments and form a lattice with respect to the same partial order usually defined on the core.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Economics
سال: 2011
ISSN: 1933-6837
DOI: 10.3982/te527